Identifying ‘Immigrants’ through Violence: Memory, Press, and Archive in the making of ‘Bangladeshi Migrants’ in Assam

This research studies the violent conflict between Bengali Muslims, who mostly migrated from the former East Bengal during colonial times, and the Bodo Tribe, who mostly follow the Bathou religion in the Bodoland region of Assam. This conflict is often seen through the preexisting lens of communal violence between Hindus and Muslims in India. Here, conflict between a religious minority and an ethnic one is investigated in its locality and this investigation highlights the complex history of the region and its part in shaping this antagonism. It does so by looking into the colonial archive which introduced the category of ‘immigrant’ to the region, together with Urdu and English press coverage of four violent events that essentialize the categories ‘Muslim’ and ‘immigrant’, respectively. Defying simple categorization, the Bengali Muslims in the Kokrajhar district have devised their own strategy for narrating time. Through archival and ethnographic research this study shows the shifting meaning of the concept of an ‘immigrant’ and its implication for social and political realities. This research addresses some less studied dynamics of the clash between two minorities and its representation in both the English and Urdu Media

Distributed and Load-Adaptive Self Configuration in Sensor Networks

Proactive self-configuration is crucial for MANETs such as sensor networks, as these are often deployed in hostile environments and are ad hoc in nature. The dynamic architecture of the network is monitored by exchanging so-called Network State Beacons (NSBs) between key network nodes. The Beacon Exchange rate and the network state define both the time and nature of a proactive action to combat network performance degradation at a time of crisis. It is thus essential to optimize these parameters for the dynamic load profile of the network. This paper presents a novel distributed adaptive optimization Beacon Exchange selection model which considers distributed network load for energy efficient monitoring and proactive reconfiguration of the network. The results show an improvement of 70% in throughput, while maintaining a guaranteed quality-of- service for a small control-traffic overhead

Efficient algorithms for dilated mappings of binary trees

The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees

Approximate algorithms for partitioning and assignment problems

The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy

On certain equations of arbitrary length over torsion-free groups

Let $G$ be a non-trivial torsion free group and $t$ be an unknown. In this paper we consider three equations (over $G$) of arbitrary length and show that they have a solution (over $G$) provided two relations among their coefficients hold. Such equations appear for all lengths greater than or equal to eight and the results presented in this article can substantially simplify their solution.Comment: arXiv admin note: substantial text overlap with arXiv:1903.0650